On Sweeping Operators for Reducing Premature Convergence of Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Improvements of real coded genetic algorithms based on differential operators preventing premature convergence
This paper presents several types of evolutionary algorithms (EAs) used for global optimization on real domains. The interest has been focused on multimodal problems, where the difficulties of a premature convergence usually occurs. First the standard genetic algorithm (SGA) using binary encoding of real values and its unsatisfactory behavior with multimodal problems is briefly reviewed togethe...
متن کاملPreventing Premature Convergence via Cooperating Genetic Algorithms
The definition of the hardness of a problem for GA’s has been tackled, eventually leading to the notion of deception [Gol89, HG94, Dav87]. It has been known for a while that the hardness of a problem is inherently related to the representation that is used. This fact will be illustrated below by showing that an easy problem (1’s counting problem) can become nearly unsolvable after a change of r...
متن کاملSegregative Genetic Algorithms (SEGA): A hybrid superstructure upwards compatible to genetic algorithms for retarding premature convergence
Many problems of combinatorial optimization belong to the class of NP-complete problems and can be solved efficiently only by heuristics. Both, Genetic Algorithms and Evolution Strategies have a number of drawbacks that reduce their applicability to that kind of problems. During the last decades plenty of work has been investigated in order to introduce new coding standards and operators especi...
متن کاملMechanisms to Avoid the Premature Convergence of Genetic Algorithms
The optimization by genetic algorithms often comes along with premature convergence bias, especially in the multimodal problems. In the paper, we propose and test two mechanisms to avoid the premature convergence of genetic algorithms by preserving the population diversity in two different manners. These are the dynamic application of many genetic operators, based on the average progress, and t...
متن کاملParallel Genetic Algorithms, Premature Convergence and the nCUBE
Genetic Algorithms (GAs), rst proposed by John Holland in the early seventies, are growing in stature as tools in the elds of machine learning and function optimization. GAs model evolution of life. To solve a particular task, a genetic algorithm creates and maintains a population of organisms, probabilistically modifying the population , while seeking a near-optimal solution to the task at han...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Institute of Control, Robotics and Systems
سال: 2011
ISSN: 1976-5622
DOI: 10.5302/j.icros.2011.17.12.1210